proof checking造句

例句与造句

1. Mathematical rigour can be defined as amenability to algorithmic proof checking.
2. The proof checking feature makes dependently typed languages closely related to proof assistants.
3. Yet, the language enables the increased level of formality necessary for automated proof checking.
4. I am proof checking a document of about 250 pages, created by someone else in Word 2003.
5. On 10 August 2014 Hales announced the completion of a formal proof using automated proof checking, removing any doubt.
6. It's difficult to find proof checking in a sentence. 用proof checking造句挺难的
7. "' Automated proof checking "'is the process of using software for checking proofs for correctness.
8. Even if Metamath is used for mathematical proof checking, its algorithm is so general we can extend the field of its usage.
9. As a former professional editor and proofreader, I can confirm that proof checking requires much more concentration and mental effort than ordinary reading.
10. Proof checking a 250-page document is not a trivial task-I'd guesstimate it to be at least 30 hours or so of hard work.
11. Automated proof checking differs from automated theorem proving in that automated proof checking simply mechanically checks the formal workings of an existing proof, instead of trying to develop new proofs or theorems itself.
12. Automated proof checking differs from automated theorem proving in that automated proof checking simply mechanically checks the formal workings of an existing proof, instead of trying to develop new proofs or theorems itself.
13. Because of this, the task of automated proof verification is much simpler than that of automated theorem proving, allowing automated proof checking software to be much simpler than automated theorem proving software.
14. Because of this small size, some automated proof checking systems can have less than a thousand lines of core code, and are thus themselves amenable to both hand-checking and automated software verification.
15. The most developed subareas of automated reasoning are automated theorem proving ( and the less automated but more pragmatic subfield of interactive theorem proving ) and automated proof checking ( viewed as guaranteed correct reasoning under fixed assumptions ).
16. :I should add that the point of Gonthier's proof of 4CT is that ( unlike Appel-Haken's ) it can be checked by a program that itself is supposed to be hand checkable ( Coq's proof checking core is based on a small, hand checkable kernel, per the de Bruijn criterion ) . talk ) 00 : 01, 27 August 2009 ( UTC)